#include <iostream>
#include <cmath>
using namespace std;
// 求最小素因子集合
void factorization(int n){
    cout << n << " = ";
    for(int i = 2; i <= sqrt(n); ++i){
        while(n % i == 0 && i < n){
            cout << i << " * ";
            n /= i;
        }
    }
    cout << n ;    //这个时候最后一个因素i刚好等于n
}

int main()
{
    int num;
    while(cin >> num){
        factorization(num);
        cout << endl;
    }
    return 0;
}